Encryption and Decryption Process Using Edge Magic Labeling
نویسندگان
چکیده
منابع مشابه
Edge-Magic Labeling of some Graphs
An edge magic labeling f of a graph with p vertices and q edges is a bijection f: V ∪ E → {1, 2, ..., p + q } such that there exists a constant s for any (x, y) in E satisfying f(x) + f(x, v) + f(y)= s. In this paper, the edge-magic labelings of ncm and some other graphs are discussed.
متن کاملData Encryption and Decryption Using ANZL Algorithm
What is the ANZL Algorithm? It is a genuine result of our work which is theoretically and practically proved. By using the ANZL Algorithm, we can test whether a given number belongs to Lucas’s series. It can also be used to find a sequence of Lucas’s numbers, starting from any number . If a given number completes the relation , we can say that it is a Lucas number and we mark it as . From the p...
متن کاملLeakage resistant encryption and decryption
Introduction Data encryption and decryption operations are basic building blocks for most security applications. For this purpose, most systems use block ciphers, such as the public AES standard. It is well known, however, that implementations of block ciphers such as AES, as well as other cryptographic algorithms, are subject to side-channel attacks [1]. These attacks allow adversaries to extr...
متن کاملDistributed Encryption and Decryption Algorithms
In this paper, we describe distributed encryption and decryption algorithms. These algorithms are required in order to make a dependable distributed data storage system in which data is stored in an encrypted form resilient to a number of arbitrarily faulty nodes in the system. By execution of these algorithms, a group of n nodes is able to encrypt or decrypt data with any secret cryptographic ...
متن کاملOn super edge-magic total labeling on subdivision of trees
An edge-magic total labeling of a graph G is a one-toone map λ from V (G) ∪ E(G) onto the integers {1, 2, · · · , |V (G) ∪ E(G)|} with the property that, there is an integer constant c such that λ(x) + λ(x, y) + λ(y) = c for any (x, y) ∈ E(G). If λ(V (G)) = {1, 2, · · · , |V (G|} then edge-magic total labeling is called super edgemagic total labeling. In this paper we formulate super edge-magic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2019
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1362/1/012024